Repairing Polygonal Meshes for Volume Meshing
نویسندگان
چکیده
In this paper a systematic approach of repairing polygonal meshes is developed for volume meshing, which can then be used in finite element analyses. All poor-quality elements are classified into three general categories: point element, line element, and overlapped element. A robust iterative scheme is proposed to remove all poor-quality elements progressively, leading to a successful volume meshing for finite element analyses. Our method is general, robust, and capable of handling non-manifold surface meshes as long as the input mesh is watertight, which is the basic requirement for volume meshing. Numerical experiments demonstrate the effectiveness of our approach.
منابع مشابه
Parameterizing Meshes with Arbitrary Topology
Parameterizing meshes is a basic requirement for many applications, including, e.g., reverse engineering , texture mapping, and re-meshing. We present a new fast algorithm that uses the hierarchical representation of a polygonal mesh with arbitrary topology for generating a geometry-driven parameterization.
متن کاملMonotone finite volume schemes for diffusion equations on unstructured triangular and shape-regular polygonal meshes
We consider a nonlinear finite volume (FV) scheme for stationary diffusion equation. We prove that the scheme is monotone, i.e. it preserves positivity of analytical solutions on arbitrary triangular meshes for strongly anisotropic and heterogeneous full tensor coefficients. The scheme is extended to regular star-shaped polygonal meshes and isotropic heterogeneous coefficients.
متن کاملEvaluation of the Finite-volume Solutions of Radiative Heat Transfer in a Complex Two-dimensional Enclosure with Unstructured Polygonal Meshes
Radiative heat transfer in a complex two-dimensional enclosure with an absorbing, emitting, and isotropically scattering gray medium is investigated by using the finite-volume method. In particular, an implementation of the unstructured polygonal meshes, based on an unstructured triangular system, is introduced, thereby reducing the computation time required for the analysis of thermal radiatio...
متن کاملDiscontinuity Meshing for Radiosity
The radiosity method is the most popular algorithm for simulating interre ection of light between di use surfaces. Most existing radiosity algorithms employ simple meshes and piecewise constant approximations, thereby constraining the radiosity function to be constant across each polygonal element. Much more accurate simulations are possible if linear, quadratic, or higher degree approximations...
متن کاملAn extension of the Crouzeix-Raviart space to general meshes with application to quasi-incompressible linear elasticity and Stokes flow
In this work we introduce a discrete functional space on general polygonal or polyhedral meshes which mimics two important properties of the standard Crouzeix–Raviart space, namely the continuity of mean values at interfaces and the existence of an interpolator which preserves the mean value of the gradient inside each element. The construction borrows ideas from both Cell Centered Galerkin and...
متن کامل